Modification of the Weighted Checksum Method Modification of the Weighted Checksum Method for Deriving Fault Tolerant Versions of the Main Linear Algebra Algorithms
نویسنده
چکیده
The modified weighted checksum method is proposed, which can be used for deriving fault tolerant versions of most linear algebra algorithms. The purpose is the detection and correction of calculation errors occurred due to transient hardware faults during algorithm execution. Using the proposed method, the faulttolerant versions of Jordan-Gauss and Faddeeva algorithms are designed. The computational complexity of new algorithms is increased approximately on O(N) multiply add operations in comparison with the original algorithms. However, new algorithms enable to detect and to correct a single error in an arbitrary row or column of input data matrices at the each algorithm step. Hence, it is possible to correct up to N and (N/2 + N⋅P) single errors during realization of whole Jordan-Gauss and Faddeeva algorithms respectively. Finally, the results of experimental verification of the proposed algorithms are represented.
منابع مشابه
Modification of the Weighted Checksum Method for Deriving Fault Tolerant Versions of the Main Linear Algebra Algorithms
The modified weighted checksum method is proposed, which can be used for deriving fault tolerant versions of most linear algebra algorithms. The purpose is the detection and correction of calculation errors occurred due to transient hardware faults during algorithm execution. Using the proposed method, the fault-tolerant versions of Jordan-Gauss and Faddeeva algorithms are designed. The computa...
متن کاملAlgorithm-Based Fault Tolerance in Linear Algebra Tasks
The modification of weighted checksum method is proposed, which allows to derive the fault tolerant versions of most linear algebra algorithms. The purpose is detection and correction of calculation errors occurred due to transient hardware faults. Using the proposed method, the fault-tolerant version of Faddeeva algorithm is designed in this paper. The computational complexity of new algorithm...
متن کاملFault Tolerant Givens Rotations Method and its Utilization for Matrix QR-Decomposition
A fault-tolerant algorithms based on Givens rotations and modified weighted checksum methods are proposed for matrix QR-decomposition. The purpose is to detect and correct the calculation errors occurred due to transient hardware faults during computation. The proposed algorithms enables to correct a single error among elements of each column or row of an input matrix A(M,N) (M=N for QR-algorit...
متن کاملFault Tolerant QR-Decomposition Algorithm Based on Givens Rotations Method and its Parallel Implementation
A fault-tolerant algorithms based on Givens rotations and modified weighted checksum methods are proposed for matrix QR-decomposition . The purpose is to detect and correct the calculation errors occurred due to transient hardware faults during computation. The proposed algorithm enables to correct a single error in each row or column of an input matrix A(M,N) occurred at any among N steps of a...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005